Complete involutive rewriting systems

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Complete involutive rewriting systems

Given a monoid string rewriting system M , one way of obtaining a complete rewriting system for M is to use the classical Knuth-Bendix critical pairs completion algorithm. It is well known that this algorithm is equivalent to computing a noncommutative Gröbner basis for M . This article develops an alternative approach, using noncommutative involutive basis methods to obtain a complete involuti...

متن کامل

Crystal bases , finite complete rewriting systems , and

This paper constructs presentations via finite complete rewriting systems for Plactic monoids of types An, Bn, Cn, Dn, and G2, using a unified proof strategy that depends on Kashiwara’s crystal bases and analogies of Young tableaux, and on Lecouvey’s presentations for these monoids. As corollaries, we deduce that Plactic monoids of these types have finite derivation type and satisfy the homolog...

متن کامل

Comprehensive Involutive Systems

In this paper we consider parametric ideals and introduce a notion of comprehensive involutive system. This notion plays the same role in theory of involutive bases as the notion of comprehensive Gröbner system in theory of Gröbner bases. Given a parametric ideal, the space of parameters is decomposed into a finite set of cells. Each cell yields the corresponding involutive basis of the ideal f...

متن کامل

On interreduction of semi-complete term rewriting systems

For a complete, i.e., connuent and terminating term rewriting system (TRS) it is well-known that simpliication (also called interreduction) into an equivalent canonical, i.e., complete and interreduced TRS is easily possible. This can be achieved by rst normalizing all right-hand sides of the TRS and then deleting all rules with a reducible left-hand side. Here we investigate the logical and op...

متن کامل

Contact Systems and Corank One Involutive Subdistributions

We give necessary and sufficient geometric conditions for a distribution (or a Pfaffian system) to be locally equivalent to the canonical contact system on J(R, R). We study the geometry of that class of systems, in particular, the existence of corank one involutive subdistributions. We also distinguish regular points, at which the system is equivalent to the canonical contact system, and singu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Symbolic Computation

سال: 2007

ISSN: 0747-7171

DOI: 10.1016/j.jsc.2007.07.005